Totally Free Expansions of Matroids
نویسندگان
چکیده
The aim of this paper is to give insight into the behaviour of inequivalent representations of 3-connected matroids. An element x of a matroid M is fixed if there is no extension MŒ of M by an element xŒ such that {x, xŒ} is independent and MŒ is unaltered by swapping the labels on x and xŒ. When x is fixed, a representation of M0x extends in at most one way to a representation of M. A 3-connected matroid N is totally free if neither N nor its dual has a fixed element whose deletion is a series extension of a 3-connected matroid. The significance of such matroids derives from the theorem, established here, that the number of inequivalent representations of a 3-connected matroid M over a finite field F is bounded above by the maximum, over all totally free minors N of M, of the number of inequivalent F-representations of N. It is proved that, within a class of matroids that is closed under minors and duality, the totally free matroids can be found by an inductive search. Such a search is employed to show that, for all r \ 4, there are unique and easily described rank-r quaternary and quinternary matroids, the first being the free spike. Finally, Seymour’s Splitter Theorem is extended by showing that the sequence of 3-connected matroids from a matroid M to a minor N, whose existence is guaranteed by the theorem, may be chosen so that all deletions and contractions of fixed and cofixed elements occur in the initial segment of the sequence. © 2001
منابع مشابه
On Totally Free Expansions of Matroids
The aim of this paper is to give insight into the behaviour of inequivalent representations of 3{connected matroids. An element x of a matroid M is xed if there is no extension M 0 of M by an element x 0 such that fx;x 0 g is independent and M 0 is unaltered by swapping the labels on x and x 0. When x is xed, a representation of M nx extends in at most one way to a representation of M. A 3{conn...
متن کاملLagrangian pairs and Lagrangian orthogonal matroids
Represented Coxeter matroids of types Cn and Dn, that is, symplectic and orthogonal matroids arising from totally isotropic subspaces of symplectic or (even-dimensional) orthogonal spaces, may also be represented in buildings of type Cn and Dn, respectively (see [4, Chapter 7]). Indeed, the particular buildings involved are those arising from the flags or oriflammes, respectively, of totally is...
متن کاملSymplectic Matroids
A symplectic matroid is a collection B of k-element subsets of J = {1, 2, . . . , n, 1∗, 2∗, . . . , n∗}, each of which contains not both of i and i∗ for every i ≤ n, and which has the additional property that for any linear ordering ≺ of J such that i ≺ j implies j∗ ≺ i∗ and i ≺ j∗ implies j ≺ i∗ for all i, j ≤ n, B has a member which dominates element-wise every other member of B. Symplectic ...
متن کاملOn Circuit Valuation of Matroids 1
The concept of valuated matroids was introduced by Dress and Wenzel as a quantitative extension of the base exchange axiom for matroids. This paper gives several sets of cryptomorphically equivalent axioms of valuated matroids in terms of (R[f 1g)-valued vectors de ned on the circuits of the underlying matroid, where R is a totally ordered additive group. The dual of a valuated matroid is chara...
متن کاملIsolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces
We deterministically construct quasi-polynomial weights in quasi-polynomial time, such that in a given polytope with totally unimodular constraints, one vertex is isolated, i.e., there is a unique minimum weight vertex. More precisely, the property that we need is that every face of the polytope lies in an affine space defined by a totally unimodular matrix. This derandomizes the famous Isolati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 84 شماره
صفحات -
تاریخ انتشار 2002